Accepted papers

• Roel Apfelbaum, Micha Sharir. An Improved Bound on the Number of Unit Area Triangles

• Boris Bukh, Jiri Matousek and Gabriel Nivasch. Lower bounds for weak epsilon-nets and stair-convexity

• Joachim Giesen, Balint Miklos, Mark Pauly and Camille Wormser. The Scale Axis Transform

• Francis Y. L. Chin, Zeyu Guo and He Sun. Minimum Manhattan Network is NP-Complete

• Eyal Ackerman, Jacob Fox, János Pach and Andrew Suk. On Grids in Topological Graphs

• Mohammad Abam and Mark de Berg. Kinetic Spanners in R^d

• Naoki Katoh and Shin-ichi Tanigawa. A Proof of the Molecular Conjecture

• Frédéric Chazal, David Cohen-Steiner, Marc Glisse, Leonidas Guibas and Steve Oudot. Proximity of Persistence Modules and their Diagrams

• Mark de Berg, Herman Haverkort and Constantinos Tsirogiannis. Visibility Maps of Realistic Terrains have Linear Smoothed Complexity

• Gaiane Panina and Ileana Streinu. Flattening single-vertex origami: the non-expansive case

• Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Juettler, Margot Rabl and Elisabeth Pilgerstorfer. Divide-and-Conquer for Voronoi Diagrams Revisited

• Marc Pouget, Sylvain Lazard, Elias Tsigaridas, Fabrice Rouillier, Luis Peñaranda and Jinsan Cheng. On the topology of planar algebraic curves

• Sylvain Pion, Vicente H. F. Batista, David L. Millman and Johannes Singler.  Parallel Geometric Algorithms for Multi-Core Computers

• Pankaj Kumar Agarwal, Esther Ezra and Micha Sharir. Near-Linear Approximation Algorithms for Geometric Hitting Sets

• Sandor Fekete, Dietmar Fey, Marcus Komann, Alexander Kroeller, Marc Reichenbach and Christiane Schmidt. Distributed Vision with Smart Pixels

• Gunnar Carlsson, Vin de Silva and Dmitriy Morozov. Zigzag Persistent Homology and Real-valued Functions

• Mikael Vejdemo-Johansson and Vin de Silva. Persistent cohomology and circular coordinates

• Andrea Vattani. k-means requires exponentially many iterations even in the plane

• Natasa Jovanovic, Jan Korst, Ramon Clout, Verus Pronk and Ludo Tolhuizen.  Candle in the Woods: Asymptotic Bounds on Minimum Blocking Sets

• Bernard Chazelle and Wolfgang Mulzer. Computing Hereditary Convex Structures

• Nabil Mustafa and Saurabh Ray. PTAS for geometric hitting set problems via Local Search

• Jean-Daniel Boissonnat, Olivier Devillers and Samuel Hornus. An efficient implementation of the Delaunay triangulation and it's graph in medium dimension

• Sang Won Bae and Kyung-Yong Chwa. The Geodesic Farthest-Site Voronoi Diagram in a Polygonal Domain with Holes

• Chuanjiang Luo, Jian Sun and Yusu Wang. Integral Estimation from Point Cloud in R^d: a Geometric View

• David Eppstein, Elena Mumford, Bettina Speckmann and Kevin Verbeek. Area-Universal Rectangular Layouts

• Andrea Francke and Michael Hoffmann. Maximum Degree Four Euclidean Minimum Spanning Tree is NP-hard

• Rom Pinchasi. Halving Lines and Measure Concentration in the Plane

• Tamal Dey and Kuiyu Li. Cut Locus and Topology from Surface Point Data

• Marc van Kreveld and Rodrigo Silveira. Embedding Rivers in Polyhedral Terrains

• Mashhood Ishaque, Bettina Speckmann and Csaba Toth. Shooting permanent rays among disjoint polygons in the plane

• Chandra Chekuri, Ken Clarkson and Sariel Har-Peled. On the Multi-Cover Problem in Geometric Settings

• Timothy Chan and Sariel Har-Peled. Approximation Algorithms for Maximum Independent Set of Pseudo-Disks

• Bernd Gärtner and Martin Jaggi. Core-Sets for Polytope Distance

• Kasturi Varadarajan. Epsilon Nets and Union Complexity

• Timothy M. Chan and Eric Y. Chen. Optimal In-Place Algorithms for 3-d Convex Hulls and 2-d Segment Intersection

• Luc Habert and Michel Pocchiola. Arrangements of double pseudolines

• Friedrich Eisenbrand, Nicolai Haehnle and Thomas Rothvoss. Diameter of Polyhedra: Limits of Abstraction

• Chee Yap and Long Lin. Parametrizability and Nonlocal Isotopy: An Approach to Efficient Approximation of Nonsingular Curves

• Erin Chambers, Jeff Erickson and Amir Nayyeri. Minimum Cuts and Shortest Homologous Cycles

• Don Sheehy and Gary Miller. Approximate Center Points with Proofs

• Csaba Toth. Binary Plane Partitions for Disjoint Line Segments

• Peyman Afshani, Chris Hamilton and Norbert Zeh. Cache-Oblivious Range Reporting With Optimal Queries Requires Superlinear Space

• Glencora Borradaile, James Lee and Anastasios Sidiropoulos. Randomly removing g handles at once

• Peyman Afshani, Chris Hamilton and Norbert Zeh. A Unified Approach for Cache-Oblivious Range Reporting and Approximate Range Counting